Multicommodity Allocation for Dynamic Demands Using PageRank Vectors
نویسندگان
چکیده
منابع مشابه
Multi-commodity Allocation for Dynamic Demands Using PageRank Vectors
We consider a variant of the contact process concerning multi-commodity allocation on networks. In this process, the demands for several types of commodities are initially given at some specified vertices and then the demands spread interactively on a contact graph. To allocate supplies in such a dynamic setting, we use a modified version of PageRank vectors, called Kronecker PageRank, to ident...
متن کاملDistributing Antidote Using PageRank Vectors
We give an analysis of a variant of the contact process on finite graphs, allowing for non-uniform cure rates, modeling antidote distribution. We examine an inoculation scheme using PageRank vectors which quantify the correlations among vertices in the contact graph. We show that for a contact graph on n nodes we can select a set H of nodes to inoculate such that with probability at least 1−2 ,...
متن کاملInteger Multicommodity Flows with Reduced Demands Integer Multicommodity Flows with Reduced Demands
Given a supply graph G = (V; E), a demand graph H = (T; D), edge capacities c : E 7 ! II N and requests r : D 7 ! II N, we consider the problem of nding integer multiiows subject to c; r. Korach and Penn constructed approximate integer multiiows for planar graphs, but no results were known for the general case. Via derandomization we present a polynomial-time approximation algorithm. There are ...
متن کاملDynamic PageRank Using Evolving Teleportation
The importance of nodes in a network constantly fluctuates based on changes in the network structure as well as changes in external interest. We propose an evolving teleportation adaptation of the PageRank method to capture how changes in external interest influence the importance of a node. This framework seamlessly generalizes PageRank because the importance of a node will converge to the Pag...
متن کاملStrong Localization in Personalized PageRank Vectors
Abstract. The personalized PageRank diffusion is a fundamental tool in network analysis tasks like community detection and link prediction. This tool models the spread of a quantity from a small, initial set of seed nodes, and has long been observed to stay localized near this seed set. We derive a sublinear upper-bound on the number of nonzeros necessary to approximate a personalized PageRank ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Internet Mathematics
سال: 2014
ISSN: 1542-7951,1944-9488
DOI: 10.1080/15427951.2013.833148